منابع مشابه
On Promptness in Parity Games
Parity games are a powerful formalism for the automatic synthesis and verification of reactive systems. They are closely related to alternating ω-automata and emerge as a natural method for the solution of the μ-calculus model checking problem. Due to these strict connections, parity games are a well-established environment to describe liveness properties such as “every request that occurs infi...
متن کاملMeasuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited
We study nondeterministic strategies in parity games with the aim of computing a most permissive winning strategy. Following earlier work, we measure permissiveness in terms of the average number/weight of transitions blocked by a strategy. Using a translation into mean-payoff parity games, we prove that deciding (the permissiveness of) a most permissive winning strategy is in NP ∩ coNP. Along ...
متن کاملSolving Parity Games on the Playstation 3
Parity games are a type of game in which two players ’play’ on a directed graph. Solving parity games is equivalent to model checking for μ-calculus. Thus, parity game solvers can be used for model checking. This requires a lot of computational power. Many-core CPUs generally have much more computational power than other CPUs. The Playstation 3 contains an advanced, modern manycore CPU, the IBM...
متن کاملStochastic Parity Games on Lossy Channel Systems
We give an algorithm for solving stochastic parity games with almost-sure winning conditions on lossy channel systems, under the constraint that both players are restricted to finitememory strategies. First, we describe a general framework, where we consider the class of 2 2 -player games with almost-sure parity winning conditions on possibly infinite game graphs, assuming that the game contain...
متن کاملOn the Complexity of Parity Games
Parity games underlie the model checking problem for the modal μ-calculus, the complexity of which remains unresolved after more than two decades of intensive research. The community is split into those who believe this problem – which is known to be both in NP and coNP – has a polynomial-time solution (without the assumption that P = NP) and those who believe that it does not. (A third, pessim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Informaticae
سال: 2015
ISSN: 0169-2968,1875-8681
DOI: 10.3233/fi-2015-1235